On the interval containing at least one prime number
نویسندگان
چکیده
منابع مشابه
Number Fields Ramified at One Prime
For G a finite group and p a prime, a G-p field is a Galois number field K with Gal(K/Q) ∼= G and disc(K) = ±p for some a. We study the existence of G-p fields for fixed G and varying p. For G a finite group and p a prime, we define a G-p field to be a Galois number field K ⊂ C satisfying Gal(K/Q) ∼= G and disc(K) = ±p for some a. Let KG,p denote the finite, and often empty, set of G-p fields. ...
متن کاملThe Least Prime Congruent to One Modulo n
It is known that there are infinitely many primes ≡ 1 (modn) for any integer n > 1. In this paper, we use an elementary argument to prove that the least such prime satisfies p ≤ 2 − 1, where φ is the Euler totient function.
متن کامل“At least one” caching
We consider a variant of the caching problem, where each request is a set of pages of a fixed size, instead of a single page. In order to serve such a request, we require at least one of those pages to be present in the cache. Each page is assumed to have unit size and unit cost for getting loaded into the cache. We prove lower bounds on the competitive ratio for this problem in both the determ...
متن کاملOn the least prime primitive root modulo a prime
We derive a conditional formula for the natural density E(q) of prime numbers p having its least prime primitive root equal to q, and compare theoretical results with the numerical evidence. 1. Theoretical result concerning the density of primes with a given least prime primitive root Let us denote, following Elliott and Murata [4], by g(p) and G(p) the least primitive and the least prime primi...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences
سال: 1952
ISSN: 0386-2194
DOI: 10.3792/pja/1195570997